Steady State Random Walks for Path Estimation
نویسندگان
چکیده
This paper describes a graph-spectral method for path estimation. Our aim is to find a maximum probability path through a lattice of pixel sites. We characterise the path recovery problem using a site transition matrix. A graph-spectral analysis of the transition matrix reveals how the maximum probability path can be located using an eigenvector of the associated normalised affinity matrix. We demonstrate the utility of the resulting method on the problem of recovering surface height from a field of surface normals.
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملA scaling law for random walks on networks
The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no g...
متن کاملSteady state and mean recurrence time for random walks on stochastic temporal networks
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of random walks on temporal networks. Here we theoretically study two types of event-driven random walks on a stochastic temporal network model that produces arb...
متن کاملSimulating Diffusion with Quantum Walks on Graphs
The path integral method has been an effective approach to solve the Fokker-Planck equation that simulates the evolution of probability distributions in diffusion processes. Yet the major challenges include the memory requirement to store the transition matrix in a fine-grained state space and a small time step required for the accurate estimation of short-time transition probabilities. Previou...
متن کاملHarmonic analysis of finite lamplighter random walks
Recently, several papers have been devoted to the analysis of lamplighter random walks, in particular when the underlying graph is the infinite path Z. In the present paper, we develop a spectral analysis for lamplighter random walks on finite graphs. In the general case, we use the C2-symmetry to reduce the spectral computations to a series of eigenvalue problems on the underlying graph. In th...
متن کامل